package datastructure.heap;

public class DsHeapNode<T> {
    T data;
    DsHeapNode<T> left;
    DsHeapNode<T> right;

    public T getData() {
        return data;
    }

    public void setData(T data) {
        this.data = data;
    }

    public DsHeapNode<T> getLeft() {
        return left;
    }

    public void setLeft(DsHeapNode<T> left) {
        this.left = left;
    }

    public DsHeapNode<T> getRight() {
        return right;
    }

    public void setRight(DsHeapNode<T> right) {
        this.right = right;
    }
}
